Lattice of Distances Based on 3d-neighbourhood Sequences
نویسندگان
چکیده
In this paper we give a natural ordering relation between distances based on 3D-neighbourhood sequences. We prove that this ordering induces a complete compact distributive lattice over the set of 3D-neighbourhood sequences.
منابع مشابه
Generating Distance Maps with Neighbourhood Sequences
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and body-centered cubic grids is presented. Conditions for the algorithm to produce correct results are derived using a path-based approach. Previous sequential algorithms for this task have been based on algorithms that...
متن کاملWeighted Distances Based on Neighbourhood Sequences in Non-standard Three-Dimensional Grids
By combining weighted distances and distances based on neighbourhood sequences, a new family of distance functions with potentially low rotational dependency is obtained. The basic theory for these distance functions, including functional form of the distance between two points, is presented for the face-centered cubic grid and the body-centered cubic grid. By minimizing an error function, the ...
متن کاملMetric and non-metric distances on Z by generalized neighbourhood sequences
The neighbourhood sequences have got a very important role in the digital image processing. In this paper we give some new results from this area. Using neighbourhood sequences on the n dimensional digital spaces, we give a formula to compute distances of any pairs of points. By practical reasons we underline the special cases of 2 and 3 dimensional digital spaces. It is known that there are no...
متن کاملWeighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids - Metricity and Algorithms
Recently, a distance function was defined on the face-centered cubic and body-centered cubic grids by combining weights and neighbourhood sequences. These distances share many properties with traditional path-based distance functions, such as the city-block distance, but are less rotational dependent. We present conditions for metricity and algorithms to compute the distances.
متن کاملShortest Paths in Triangular Grids with Neighbourhood Sequences
In this paper we analyse some properties of the triangular and hexagonal grids in the 2D digital space. We define distances based on neighbourhood relations that can be introduced in these grids. We present an algorithm, which calculates the distance from an arbitrary point to another one for a given neighbourhood sequence in the triangular grid. Moreover, this algorithm produces the shortest p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999